Second-order iterations with guaranteed convergence
نویسندگان
چکیده
منابع مشابه
Second Order Sliding Mode Control With Finite Time Convergence
In this paper, a new smooth second order sliding mode control is proposed. This algorithm is a modified form of Super Twisting algorithm. The Super Twisting guarantees the asymptotic stability, but the finite time stability of proposed method is proved with introducing a new particular Lyapunov function. The Proposed algorithm which is able to control nonlinear systems with matched structured u...
متن کاملsecond order sliding mode control with finite time convergence
in this paper, a new smooth second order sliding mode control is proposed. this algorithm is a modified form of super twisting algorithm. the super twisting guarantees the asymptotic stability, but the finite time stability of proposed method is proved with introducing a new particular lyapunov function. the proposed algorithm which is able to control nonlinear systems with matched structured u...
متن کاملNon-monotone Fixpoint Iterations to Resolve Second Order E ects
We present a new xpoint theorem which guarantees the existence and the nite computability of the least common solution of a countable system of recursive equations over a wellfounded domain. The functions are only required to be increasing and delay-monotone, the latter being a property much weaker than monotonicity. We hold that wellfoundedness is a natural condition as it guarantees terminati...
متن کاملNon-monotone Fixpoint Iterations to Resolve Second Order Eeects
We present a new xpoint theorem which guarantees the existence and the nite computability of the least common solution of a countable system of recursive equations over a wellfounded domain. The functions are only required to be increasing and delay-monotone, the latter being a property much weaker than monotonicity. We hold that wellfoundedness is a natural condition as it guarantees terminati...
متن کاملConvergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions are quite difficult – even unsolvable. In this paper we will concentrate on very simple iterations of the form
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1984
ISSN: 0377-0427
DOI: 10.1016/0377-0427(84)90040-2